Infinitary propositional intuitionistic logic.
نویسندگان
چکیده
منابع مشابه
Semantics of intuitionistic propositional logic
Intuitionistic logic is a weakening of classical logic by omitting, most prominently, the principle of excluded middle and the reductio ad absurdum rule. As a consequence, this logic has a wider range of semantical interpretations. The motivating semantics is the so called Brouwer-Heyting-Kolmogorov interpretation of logic. The propositions A,B,C, . . . are regarded as problems or tasks to be s...
متن کاملBisimulation and Propositional Intuitionistic Logic
The Brouwer-Heyting-Kolmogorov interpretation of intuition-istic logic suggests that p q can be interpreted as a computation that given a proof of p constructs a proof of q. Dually, we show that every nite canonical model of q contains a nite canonical model of p. If q and p are interderivable, their canonical models contain each other. Using this insight, we are able to characterize validity i...
متن کاملProof Complexity of Intuitionistic Propositional Logic
We explore the proof complexity of intuitionistic propositional logic (IPL). The problem of determining whether or not an intuitionistic formula is valid is PSPACE-Complete via a reduction from QBF . In view of this reduction (due to Statman), it is natural to compare the proof-theoretic strength of a standard axiomatic system for IPL with a similar proof system for classical quantified Boolean...
متن کاملSequent calculi for bi-intuitionistic propositional logic
Bi-intuitionistic logic is the conservative extension of intuitionistic logic with a connective dual to implication. It is sometimes presented as a symmetric constructive subsystem of classical logic. In this talk, we compare three sequent calculi for bi-intuitionistic propositional logic: (1) a basic standard-style sequent calculus that restricts the premises of implication-right and exclusion...
متن کاملIntuitionistic Propositional Logic is Polynomial-Space Complete
Abatraet. It is the purpose of this note to show that the question of whether a given propositional formula is intuitionistically valid (in Brouwer’s sense, in Kripke’s sense, or just provable by Heyting’s rules, see Kreisel[7]) is p-space complete (see Stockmeyer [14]). Our result has the following consequences: (a) There is a simple (i.e. polynomial time) translation of intuitionistic proposi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 1980
ISSN: 0029-4527
DOI: 10.1305/ndjfl/1093883041